منابع مشابه
Distinguishing Maps
The distinguishing number of a group A acting faithfully on a set X, denoted D(A,X), is the least number of colors needed to color the elements of X so that no nonidentity element of A preserves the coloring. Given a map M (an embedding of a graph in a closed surface) with vertex set V and without loops or multiples edges, let D(M) = D(Aut(M), V ), where Aut(M) is the automorphism group of M ; ...
متن کاملDistinguishing Maps II: General Case
A group A acting faithfully on a set X has distinguishing number k, written D(A,X) = k, if there is a coloring of the elements of X with k colors such that no nonidentity element of A is color-preserving, and no such coloring with fewer than k colors exists. Given a map M with vertex set V and automorphism group Aut(M), let D(M) = D(Aut(M), V ). If M is orientable, let D+(M) = D(Aut+(M), V ), w...
متن کاملDistinguishing number and distinguishing index of natural and fractional powers of graphs
The distinguishing number (resp. index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (resp. edge labeling) with $d$ labels that is preserved only by a trivial automorphism. For any $n in mathbb{N}$, the $n$-subdivision of $G$ is a simple graph $G^{frac{1}{n}}$ which is constructed by replacing each edge of $G$ with a path of length $n$...
متن کاملThe relationship between the distinguishing number and the distinguishing index with detection number of a graph
This article has no abstract.
متن کاملDistinguishing Bonds.
The energy change per electron in a chemical or physical transformation, ΔE/n, may be expressed as Δχ̅ + Δ(VNN + ω)/n, where Δχ̅ is the average electron binding energy, a generalized electronegativity, ΔVNN is the change in nuclear repulsions, and Δω is the change in multielectron interactions in the process considered. The last term can be obtained by the difference from experimental or theoreti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2011
ISSN: 1077-8926
DOI: 10.37236/537